xxi, 1180 pages ; 24 cm

The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor

Revised edition of: Introduction to algorithms / Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest. c1990

Includes bibliographical references (pages 1127-1130) and index

The role of algorithms in computing -- Getting started -- Growth of functions -- Recurrences -- Probabilistic analysis and randomized algorithms -- Heapsort -- Quicksort -- Sorting in linear time -- Medians and order statistics -- Elementary data structures -- Hash Tables -- Binary Search trees -- Red-black trees -- Augmenting data structures -- Dynamic programming -- Greedy Algorithms -- Amortized analysis -- B-trees -- Binomial heaps -- Fibonacci heaps -- Data structures for disjoint sets -- Elementary graph algorithms -- Minimum spanning trees -- Single-source shortest paths -- All-pairs shortest paths -- Maximum flow -- Sorting networks -- Matrix operations-- Linear programming -- Polynomials and the FFT -- Number-theoretic algorithms -- String matching-- Computational geometry -- NP-completeness -- approximation algorithms -- A. summations -- B. Sets, etc. -- C. Counting and probability

plus-circle Add Review

comment

Reviews